Randomized Greedy Hot-Potato Routing

Randomized Greedy Hot-Potato Routing

Near-Optimal Hot-Potato Routing on Trees

In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, which causes conflicting packets to be deflected away from their destinations. We study one-to-many batch routing problems on arbitrary tree topologies. We present two hot-potato routing algorithms, one deterministic and one randomized, whose routing times are asymptotically near-optimal (within pol...

Greedy Õ(C +D) Hot-Potato Routing on Trees

In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit. A hotpotato routing algorithm is greedy if packets are advanced from their sources toward their destinations whenever possible. The dilation D is the longest distance a packet has to travel; the congestion C is the maximum number of packets that traverse any edge. The routing time of a routing-algor...

Lower bounds for hot-potato permutation routing on trees

In this paper we consider hot-potato packet routing on trees. As a lower bound, for all sufficiently large n we construct a permutation routing problem on an n-node tree for which an oblivious greedy hot-potato algorithm requires at least 2n o(n) time steps. This lower bound is also valid for the minimumdistance heuristic. Applying the charging argument of Borodin et al. [8] we establish that a...

Pure Greedy Hot-Potato Routing in the 2-D Mesh with Random Destinations

We analyze here a pure greedy hot-potato routing strategy on a two-dimensional mesh of n nodes. We speci cally study the case of n packets, originating one per node, to be delivered at random uniform destinations. Each packet attempts to follow the shortest path leading rst to the destination row/column (whichever is closest) and then to the actual destination node. A de ection policy is adopte...